Ant Colonies Discover Knight's Tours
نویسندگان
چکیده
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism of ACO’s to simultaneously search for tours starting from all positions on the chessboard. We compare the new algorithm to a recently reported genetic algorithm, and to a depth-first backtracking search using Warnsdorff’s heuristic. The new algorithm is superior in terms of search bias and also in terms of the rate of finding solutions.
منابع مشابه
Knight's Tours of an 8 8 Chessboard
We describe a computation that determined the number of knight's tours of a standard chessboard. We also verify Knuth's count of tours with a symmetry.
متن کاملGeneralised Knight's Tours
The problem of existence of closed knight’s tours in [n]d, where [n] = {0, 1, 2, . . . , n− 1}, was recently solved by Erde, Golénia, and Golénia. They raised the same question for a generalised, (a, b) knight, which is allowed to move along any two axes of [n]d by a and b unit lengths respectively. Given an even number a, we show that the [n]d grid admits an (a, 1) knight’s tour for sufficient...
متن کاملBounds on the Number of Knight's Tours
Knight’s tours are a fascinating subject. New lower bounds on the number of knight’s tours and structured knight’s tours on n x IZ chessboards and even n are presented. For the natural special case n = 8 a new upper bound is proved.
متن کاملKnight's Tours in Higher Dimensions
In this paper we are concerned with knight’s tours on high-dimensional boards. Our main aim is to show that on the d-dimensional board [n], with n even, there is always a knight’s tour provided that n is sufficiently large. In fact, we give an exact classification of the grids [n1] × . . . × [nd] in which there is a knight’s tour. This answers questions of DeMaio, DeMaio and Mathew, and Watkins.
متن کاملThe Theory of Zero-Suppressed BDDs and the Number of Knight's Tours
Zero{suppressed binary decision diagrams (ZBDDs) have been introduced by Minato ((14] { 17]) who presents applications for cube set representations, fault simulation , timing analysis and the n{queens{problem. Here the structural properties of ZBDDs are worked out and a generic synthesis algorithm is presented and analyzed. It is proved that ZBDDs can be at most by a factor n + 1 smaller or lar...
متن کامل